Erdos-Renyi random graphs + forest fires = self-organized criticality
نویسندگان
چکیده
منابع مشابه
Erdős - Rényi Random Graphs + Forest Fires = Self - Organized Criticality
We modify the usual Erd˝ os-Rényi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the system sticks to a permanent critical state. The authors thank the anonymous referee for thoroughly reading the manuscript. Her/his comments and suggestions hel...
متن کاملSelf-organized criticality in forest-landscape evolution
A simple cellular automaton replicates the fractal pattern of a natural forest landscape and predicts its evolution. Spatial distributions and temporal fluctuations in global quantities show power-law spectra, implying scale-invariance, characteristic of self-organized criticality. The evolution toward the SOC state and the robustness of that state to perturbations are described. 2002 Elsevie...
متن کاملSelf-Organized Criticality on Quasiperiodic Graphs
Self-organized critical models are used to describe the 1/f-spectra of rather different physical situations like snow avalanches, noise of electric currents, luminosities of stars or topologies of landscapes. The prototype of the SOC-models is the sandpile model of Bak, Tang and Wiesenfeld (Phys. Rev. Lett. 59, (1987) 381). We implement this model on non-periodic graphs where it can become eith...
متن کاملSelf-Organized Criticality on Non-periodic Graphs
Self-organized critical models are used to describe the 1/f-spectra of rather different physical situations like snow avalanches, noise of electric currents, luminosities of stars or topologies of landscapes. The prototype of the SOC-models is the sandpile model of Bak, Tang and Wiesenfeld [1]. We implement this model on non-periodic graphs where it can become either isotropic or anisotropic an...
متن کاملExact alignment recovery for correlated Erdos Renyi graphs
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdős-Rényi (ER) graphs on the same vertex set. The correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs. We determine the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2009
ISSN: 1083-6489
DOI: 10.1214/ejp.v14-653